Merging with Integrity Constraints ?

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Belief Base Rationalization for Propositional Merging

Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraints. In this paper, we show that this is not suited to every merging scenario. We study the case when the bases are ”rationalized” with respect to the integrity constraints during the merging process. We define in formal terms several independence conditions for...

متن کامل

Merging information under constraints: a qualitative framework

We consider the problem of merging several belief bases in the presence of integrity constraints. We propose a logical characterization of operators having a majority behaviour or a consensual one. Then we give a representation theorem in terms of pre-orders on interpretations. We show the close connection between belief revision and merging operators and we show that our proposal extends the p...

متن کامل

Merging Information Under Constraints: A Logical Framework

The paper considers the problem of merging several belief bases in the presence of integrity constraints and proposes a logical characterization of operators having a majority behaviour or a consensual one. Then a representation theorem in terms of pre-orders on interpretations is given. The close connection between belief revision and merging operators is shown and it is shown that the proposa...

متن کامل

Quasi-merging and Pure-arbitration on Information for the Family of Adaptive Logics ADM∗

The present paper introduces two new information merging protocols for the family of adaptive logics ADM, for which majority merging has been defined in previous work. The new adaptive operators reflect the negotiation processes of quasi-merging and pure-arbitration known from the Integrity Constraints framework. The Adaptive Variant Counting selection provides results equivalent to the GMax fa...

متن کامل

ADM Quasi-merging and Pure-arbitration∗

The present paper introduces two new information merging protocols for the family of adaptive logics ADM, for which majority merging has been defined in [19]. The new adaptive operators reflect the negotiation processes of quasi-merging and pure arbitration, known from the Integrity Constraints framework introduced in [13]. The Adaptive Variant Counting selection provides a result equivalent to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999